Studying Platelet-Based Depth Map Coding
نویسندگان
چکیده
The multi-view plus depth (MVD) format is a promising representation approach for 3D and free viewpoint video systems as it allows synthesizing more views at the decoder than those explicitly coded at the encoder. This format represents each view of a visual scene with both texture (array of color pixels) and a depth map which provides information about the 3D scene geometry. Thus, for the transmission of MVD data, both texture and the associated depth maps need to be efficiently coded. For depth maps, coding artifacts should be minimized (especially at the object boundaries) since they can lead to severe geometric distortions in the virtual intermediate views. A popular approach to code depth maps is the so-called platelet coding scheme which uses piece-wise linear functions and quad-tree decomposition to model the depth information. In this context, this paper studies the performance of plateletbased depth map coding, notably through the analysis of several statistics such as the frequency of each modeling function, the selected block sizes and the bits consumed for the function coefficients. The platelet-based depth map coding rate-distortion (RD) performance is evaluated and compared to other standard based depth map coding solutions. This study is important not only to understand the weaknesses and strengths of this coding solution but also to design new techniques to improve the MVD coding efficiency. Keywords— depth map; quad-tree; platelet coding; multiview plus depth coding;
منابع مشابه
Fast Intra Mode Decision for Depth Map coding in 3D-HEVC Standard
three dimensional- high efficiency video coding (3D-HEVC) is the expanded version of the latest video compression standard, namely high efficiency video coding (HEVC), which is used to compress 3D videos. 3D videos include texture video and depth map. Since the statistical characteristics of depth maps are different from those of texture videos, new tools have been added to the HEVC standard fo...
متن کاملCompression Algorithm for Multi-view Video Coding Using a Depth Map
In this paper, we propose an efficient multi-view video coding algorithm that uses a depth map. This algorithm is based on the correlation between texture maps and depth maps. This correlation is based on the fact that the motion vectors (MVs) in texture maps are strongly affected by their depth values. In general, background objects have smaller MVs whereas foreground objects have higher MVs. ...
متن کاملLow-complexity depth map compression in HEVC-based 3D video coding
In this paper, a low-complexity algorithm is proposed to reduce the complexity of depth map compression in the high-efficiency video coding (HEVC)-based 3D video coding (3D-HEVC). Since the depth map and the corresponding texture video represent the same scene in a 3D video, there is a high correlation among the coding information from depth map and texture video. An experimental analysis is pe...
متن کاملDisparity field and depth map coding for multiview 3D image generation
In the present paper techniques are examined for the coding of the depth map and disparity elds for stereo or multiview image communication applications. It is assumed that both the left and right channels of the multiview image sequence are coded using blockor object-based methods. A dynamic programming algorithm is used to estimate a disparity eld between each stereo image pair. Depth is then...
متن کاملH.264-Based Depth Map Sequence Coding Using Motion Information of Corresponding Texture Video
Three-dimensional television systems using depth-image-based rendering techniques are attractive in recent years. In those systems, a monoscopic two-dimensional texture video and its associated depth map sequence are transmitted. In order to utilize transmission bandwidth and storage space efficiently, the depth map sequence should be compressed as well as the texture video. Among previous work...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013